0.11/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.11/0.12 % Command : run_vampire %s %d THM 0.11/0.32 % Computer : n009.cluster.edu 0.11/0.32 % Model : x86_64 x86_64 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.32 % Memory : 8042.1875MB 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.32 % CPULimit : 1440 0.11/0.32 % WCLimit : 180 0.11/0.32 % DateTime : Thu Jul 4 06:05:09 EDT 2024 0.11/0.33 % CPUTime : 0.11/0.34 This is a THF_ problem 0.11/0.34 Running higher-order theorem proving 0.11/0.35 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.rZoCiZ6ZKw/E---3.1_11204.p -m 16384 -t 180 0.11/0.37 % (11312)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_11204 for (1799ds/183Mi) 0.11/0.37 % (11316)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_11204 for (1799ds/2Mi) 0.11/0.37 % (11313)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_11204 for (1799ds/4Mi) 0.11/0.37 % (11317)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_11204 for (1799ds/275Mi) 0.11/0.37 % (11318)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_11204 for (1799ds/18Mi) 0.11/0.37 % (11315)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_11204 for (1799ds/2Mi) 0.11/0.37 % (11314)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_11204 for (1799ds/27Mi) 0.11/0.37 % (11315)Instruction limit reached! 0.11/0.37 % (11315)------------------------------ 0.11/0.37 % (11315)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.11/0.37 % (11315)Termination reason: Unknown 0.11/0.37 % (11315)Termination phase: Saturation 0.11/0.37 % (11316)Instruction limit reached! 0.11/0.37 % (11316)------------------------------ 0.11/0.37 % (11316)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.11/0.37 % (11316)Termination reason: Unknown 0.11/0.37 % (11316)Termination phase: Saturation 0.11/0.37 0.11/0.37 % (11316)Memory used [KB]: 5500 0.11/0.37 % (11316)Time elapsed: 0.004 s 0.11/0.37 % (11316)Instructions burned: 2 (million) 0.11/0.37 % (11316)------------------------------ 0.11/0.37 % (11316)------------------------------ 0.11/0.37 0.11/0.37 % (11315)Memory used [KB]: 5500 0.11/0.37 % (11315)Time elapsed: 0.004 s 0.11/0.37 % (11315)Instructions burned: 2 (million) 0.11/0.37 % (11315)------------------------------ 0.11/0.37 % (11315)------------------------------ 0.11/0.37 % (11314)Refutation not found, incomplete strategy 0.11/0.37 % (11314)------------------------------ 0.11/0.37 % (11314)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.11/0.37 % (11314)Termination reason: Refutation not found, incomplete strategy 0.11/0.37 0.11/0.37 0.11/0.37 % (11314)Memory used [KB]: 5500 0.11/0.37 % (11314)Time elapsed: 0.004 s 0.11/0.37 % (11314)Instructions burned: 2 (million) 0.11/0.37 % (11314)------------------------------ 0.11/0.37 % (11314)------------------------------ 0.11/0.37 % (11313)Instruction limit reached! 0.11/0.37 % (11313)------------------------------ 0.11/0.37 % (11313)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.11/0.37 % (11317)Refutation not found, incomplete strategy 0.11/0.37 % (11317)------------------------------ 0.11/0.37 % (11317)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.11/0.37 % (11313)Termination reason: Unknown 0.11/0.37 % (11313)Termination phase: Saturation 0.11/0.37 0.11/0.37 % (11313)Memory used [KB]: 5500 0.11/0.37 % (11313)Time elapsed: 0.006 s 0.11/0.37 % (11313)Instructions burned: 5 (million) 0.11/0.37 % (11313)------------------------------ 0.11/0.37 % (11313)------------------------------ 0.11/0.37 % (11317)Termination reason: Refutation not found, incomplete strategy 0.11/0.37 0.11/0.37 0.11/0.37 % (11317)Memory used [KB]: 5500 0.11/0.37 % (11317)Time elapsed: 0.005 s 0.11/0.37 % (11317)Instructions burned: 4 (million) 0.11/0.37 % (11317)------------------------------ 0.11/0.37 % (11317)------------------------------ 0.11/0.37 % (11318)First to succeed. 0.11/0.38 % (11318)Refutation found. Thanks to Tanya! 0.11/0.38 % SZS status Theorem for E---3.1_11204 0.11/0.38 % SZS output start Proof for E---3.1_11204 0.11/0.38 thf(type_def_5, type, a: $tType). 0.11/0.38 thf(func_def_0, type, a: $tType). 0.11/0.38 thf(func_def_1, type, j: a > a). 0.11/0.38 thf(func_def_2, type, g: (a > a) > a > a). 0.11/0.38 thf(func_def_3, type, h: a > a). 0.11/0.38 thf(func_def_4, type, f: (a > a) > a > a). 0.11/0.38 thf(func_def_8, type, sK0: (a > a) > $o). 0.11/0.38 thf(func_def_11, type, ph2: !>[X0: $tType]:(X0)). 0.11/0.38 thf(func_def_16, type, sK3: a). 0.11/0.38 thf(func_def_17, type, sK4: a). 0.11/0.38 thf(f86,plain,( 0.11/0.38 $false), 0.11/0.38 inference(subsumption_resolution,[],[f85,f17])). 0.11/0.38 thf(f17,plain,( 0.11/0.38 ( ! [X0 : a] : (((h @ X0) = (j @ X0))) )), 0.11/0.38 inference(leibniz_equality_elimination,[],[f11])). 0.11/0.38 thf(f11,plain,( 0.11/0.38 ( ! [X4 : a,X5 : a > $o] : (((X5 @ (h @ X4)) != $true) | ((X5 @ (j @ X4)) = $true)) )), 0.11/0.38 inference(cnf_transformation,[],[f10])). 0.11/0.38 thf(f10,plain,( 0.11/0.38 ! [X0 : a > $o,X1 : a,X2 : a > a] : (((X0 @ (f @ X2 @ X1)) != $true) | ((X0 @ (g @ X2 @ X1)) = $true)) & (((sK0 @ (g @ j)) != $true) & ((sK0 @ (f @ h)) = $true)) & ! [X4 : a,X5 : a > $o] : (((X5 @ (j @ X4)) = $true) | ((X5 @ (h @ X4)) != $true))), 0.11/0.38 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])). 0.11/0.38 thf(f9,plain,( 0.11/0.38 ? [X3 : (a > a) > $o] : (((X3 @ (g @ j)) != $true) & ((X3 @ (f @ h)) = $true)) => (((sK0 @ (g @ j)) != $true) & ((sK0 @ (f @ h)) = $true))), 0.11/0.38 introduced(choice_axiom,[])). 0.11/0.38 thf(f8,plain,( 0.11/0.38 ! [X0 : a > $o,X1 : a,X2 : a > a] : (((X0 @ (f @ X2 @ X1)) != $true) | ((X0 @ (g @ X2 @ X1)) = $true)) & ? [X3 : (a > a) > $o] : (((X3 @ (g @ j)) != $true) & ((X3 @ (f @ h)) = $true)) & ! [X4 : a,X5 : a > $o] : (((X5 @ (j @ X4)) = $true) | ((X5 @ (h @ X4)) != $true))), 0.11/0.38 inference(rectify,[],[f7])). 0.11/0.38 thf(f7,plain,( 0.11/0.38 ! [X3 : a > $o,X4 : a,X2 : a > a] : (((X3 @ (f @ X2 @ X4)) != $true) | ((X3 @ (g @ X2 @ X4)) = $true)) & ? [X5 : (a > a) > $o] : (((X5 @ (g @ j)) != $true) & ((X5 @ (f @ h)) = $true)) & ! [X1 : a,X0 : a > $o] : (((X0 @ (j @ X1)) = $true) | ((X0 @ (h @ X1)) != $true))), 0.11/0.38 inference(flattening,[],[f6])). 0.11/0.38 thf(f6,plain,( 0.11/0.38 ? [X5 : (a > a) > $o] : (((X5 @ (g @ j)) != $true) & ((X5 @ (f @ h)) = $true)) & (! [X3 : a > $o,X4 : a,X2 : a > a] : (((X3 @ (f @ X2 @ X4)) != $true) | ((X3 @ (g @ X2 @ X4)) = $true)) & ! [X1 : a,X0 : a > $o] : (((X0 @ (j @ X1)) = $true) | ((X0 @ (h @ X1)) != $true)))), 0.11/0.38 inference(ennf_transformation,[],[f5])). 0.11/0.38 thf(f5,plain,( 0.11/0.38 ~((! [X3 : a > $o,X4 : a,X2 : a > a] : (((X3 @ (f @ X2 @ X4)) = $true) => ((X3 @ (g @ X2 @ X4)) = $true)) & ! [X0 : a > $o,X1 : a] : (((X0 @ (h @ X1)) = $true) => ((X0 @ (j @ X1)) = $true))) => ! [X5 : (a > a) > $o] : (((X5 @ (f @ h)) = $true) => ((X5 @ (g @ j)) = $true)))), 0.11/0.38 inference(fool_elimination,[],[f4])). 0.11/0.38 thf(f4,plain,( 0.11/0.38 ~((! [X0 : a > $o,X1 : a] : ((X0 @ (h @ X1)) => (X0 @ (j @ X1))) & ! [X2 : a > a,X3 : a > $o,X4 : a] : ((X3 @ (f @ X2 @ X4)) => (X3 @ (g @ X2 @ X4)))) => ! [X5 : (a > a) > $o] : ((X5 @ (f @ h)) => (X5 @ (g @ j))))), 0.11/0.38 inference(rectify,[],[f2])). 0.11/0.38 thf(f2,negated_conjecture,( 0.11/0.38 ~((! [X0 : a > $o,X3 : a] : ((X0 @ (h @ X3)) => (X0 @ (j @ X3))) & ! [X1 : a > a,X0 : a > $o,X2 : a] : ((X0 @ (f @ X1 @ X2)) => (X0 @ (g @ X1 @ X2)))) => ! [X0 : (a > a) > $o] : ((X0 @ (f @ h)) => (X0 @ (g @ j))))), 0.11/0.38 inference(negated_conjecture,[],[f1])). 0.11/0.38 thf(f1,conjecture,( 0.11/0.38 (! [X0 : a > $o,X3 : a] : ((X0 @ (h @ X3)) => (X0 @ (j @ X3))) & ! [X1 : a > a,X0 : a > $o,X2 : a] : ((X0 @ (f @ X1 @ X2)) => (X0 @ (g @ X1 @ X2)))) => ! [X0 : (a > a) > $o] : ((X0 @ (f @ h)) => (X0 @ (g @ j)))), 0.11/0.38 file('/export/starexec/sandbox/tmp/tmp.rZoCiZ6ZKw/E---3.1_11204.p',cEDEC_pme)). 0.11/0.38 thf(f85,plain,( 0.11/0.38 ((j @ sK4) != (h @ sK4))), 0.11/0.38 inference(negative_extensionality,[],[f84])). 0.11/0.38 thf(f84,plain,( 0.11/0.38 (h != j)), 0.11/0.38 inference(equality_resolution,[],[f83])). 0.11/0.38 thf(f83,plain,( 0.11/0.38 ((g @ h @ sK3) != (g @ j @ sK3))), 0.11/0.38 inference(superposition,[],[f56,f58])). 0.11/0.38 thf(f58,plain,( 0.11/0.38 ( ! [X0 : a > a,X1 : a] : (((g @ X0 @ X1) = (f @ X0 @ X1))) )), 0.11/0.38 inference(leibniz_equality_elimination,[],[f14])). 0.11/0.38 thf(f14,plain,( 0.11/0.38 ( ! [X2 : a > a,X0 : a > $o,X1 : a] : (((X0 @ (f @ X2 @ X1)) != $true) | ((X0 @ (g @ X2 @ X1)) = $true)) )), 0.11/0.38 inference(cnf_transformation,[],[f10])). 0.11/0.38 thf(f56,plain,( 0.11/0.38 ((f @ h @ sK3) != (g @ j @ sK3))), 0.11/0.38 inference(negative_extensionality,[],[f16])). 0.11/0.38 thf(f16,plain,( 0.11/0.38 ((f @ h) != (g @ j))), 0.11/0.38 inference(trivial_inequality_removal,[],[f15])). 0.11/0.38 thf(f15,plain,( 0.11/0.38 ((f @ h) != (g @ j)) | ($true != $true)), 0.11/0.38 inference(constrained_superposition,[],[f13,f12])). 0.11/0.38 thf(f12,plain,( 0.11/0.38 ((sK0 @ (f @ h)) = $true)), 0.11/0.38 inference(cnf_transformation,[],[f10])). 0.11/0.38 thf(f13,plain,( 0.11/0.38 ((sK0 @ (g @ j)) != $true)), 0.11/0.38 inference(cnf_transformation,[],[f10])). 0.11/0.38 % SZS output end Proof for E---3.1_11204 0.11/0.38 % (11318)------------------------------ 0.11/0.38 % (11318)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.11/0.38 % (11318)Termination reason: Refutation 0.11/0.38 0.11/0.38 % (11318)Memory used [KB]: 5628 0.11/0.38 % (11318)Time elapsed: 0.009 s 0.11/0.38 % (11318)Instructions burned: 9 (million) 0.11/0.38 % (11318)------------------------------ 0.11/0.38 % (11318)------------------------------ 0.11/0.38 % (11311)Success in time 0.012 s 0.11/0.38 EOF